Implementation of Hardware Structures through Conngurable Logic
نویسندگان
چکیده
This paper describes an alternative approach to implement Computer Architecture Structures. It employs an array of identical devices that can be dynamically conngured by the application programmer. Known as \array of conngurable logic cells," this RAM-based FPGA ooers many research opportunities in the Computer Architecture area. The paper presents the design of an array of programmable devices, the mapping process of basic Architecture Structures onto the array , and the current stage of the project.
منابع مشابه
Implementing Boolean Satissability in Conngurable Hardware
1 Introduction Implementations of Boolean satissability (SAT) have been used to accelerate solution of a wide range of problems in Automatic Test Pattern Generation (ATPG), cryptology, artiicial intelligence and other elds 2, 6, 5, 8]. While the performance of software SAT solvers has improved greatly, they can still be too slow for diicult problems. Recently, there has been increasing interest...
متن کاملUsing Conngurable Computing to Accelerate Boolean Satissability
| The issues of software compute time and complexity are very important in current CAD tools. As FPGA speeds and densities increase, the opportunity for eeective hardware accelerators built from FPGA technology has opened up. This paper describes and evaluates a formula-speciic method for implementing Boolean satissa-bility solver circuits in conngurable hardware. That is, using a template gene...
متن کاملAccelerating Boolean Satissability with Conngurable Hardware
This paper describes and evaluates methods for implementing formula-speciic Boolean satissability (SAT) solver circuits in conngurable hardware. Starting from a general template design, our approach automatically generates VHDL for a circuit that is speciic to the particular Boolean formula being solved. Such an approach tightly customizes the circuit to a particular problem instance. Thus, it ...
متن کاملA Novel and Efficient Hardware Implementation of Scalar Point Multiplier
A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...
متن کاملUsing Recon gurable Hardware to Customize Memory Hierarchies
Over the past decade or more, processor speeds have increased much more quickly than memory speeds. As a result, a large, and still increasing, processor-memory performance gap has formed. Many signii-cant applications suuer from substantial memory and communication bottlenecks, and their memory performance problems are often either too unusual or extreme to be mitigated by cache memories alone...
متن کامل